AbstractThis note discusses the results of the compilational approach of equational logic programming developed by Van Emden and Yukawa, and compares them with similar results obtained by Bosco et al. and by Fribourg. We show that Van Emden and Yukawa's completeness result contains an inaccuracy, and we suggest how to correct it
AbstractEquational logic programming is an extended programming paradigm of equational programming. ...
We formalize equational propositional logic, prove that it is sound and complete, and compare the eq...
This work develops new automated reasoning techniques for verifying the correctness of equationally ...
AbstractThis note discusses the results of the compilational approach of equational logic programmin...
We show the completeness of an extension of SLD resolution to the equational setting. This proves a ...
AbstractWe show the completeness of an extension of SLD-resolution to the equational setting. This p...
In 1975 I started a small project to explore the consequences of implementing equational programs wi...
We provide a mathematical theory and methodology for synthesising equationallogics from algebraic me...
We present two dierent formalizations of Equational Predicate Logic, that is, rst order logic that ...
1 Introduction Programming is difficult, as shown by the fact that debugging a program usually takes...
Equality plays an important role in our life, and we practise equational reasoning everyday. We can ...
In 1975 I started a small project to explore the consequences of implementing equational programs wi...
An \em equational system\/ is a set of equations. Often we are interested in knowing if an equation ...
technical reportThis thesis studies first-order unification in equational theories, called E-unifica...
This thesis proposes a general framework for equational logic programming, called category-based equ...
AbstractEquational logic programming is an extended programming paradigm of equational programming. ...
We formalize equational propositional logic, prove that it is sound and complete, and compare the eq...
This work develops new automated reasoning techniques for verifying the correctness of equationally ...
AbstractThis note discusses the results of the compilational approach of equational logic programmin...
We show the completeness of an extension of SLD resolution to the equational setting. This proves a ...
AbstractWe show the completeness of an extension of SLD-resolution to the equational setting. This p...
In 1975 I started a small project to explore the consequences of implementing equational programs wi...
We provide a mathematical theory and methodology for synthesising equationallogics from algebraic me...
We present two dierent formalizations of Equational Predicate Logic, that is, rst order logic that ...
1 Introduction Programming is difficult, as shown by the fact that debugging a program usually takes...
Equality plays an important role in our life, and we practise equational reasoning everyday. We can ...
In 1975 I started a small project to explore the consequences of implementing equational programs wi...
An \em equational system\/ is a set of equations. Often we are interested in knowing if an equation ...
technical reportThis thesis studies first-order unification in equational theories, called E-unifica...
This thesis proposes a general framework for equational logic programming, called category-based equ...
AbstractEquational logic programming is an extended programming paradigm of equational programming. ...
We formalize equational propositional logic, prove that it is sound and complete, and compare the eq...
This work develops new automated reasoning techniques for verifying the correctness of equationally ...
DOI
Add to ORKG